Ontology-Based Integration of Streaming and Static Relational Data with Optique

An important application of semantic technologies in industry has been the formalisation of information models usingOWL 2 ontologies and the use of RDF for storing and exchanging application data. Moreover, legacy data can be virtualised asRDF using ontologies following the ontology-based data access (OBDA) approach. In all these applications, it is important toprovide domain experts with query formulation tools for expressing their information needs in terms of queries over ontologies. Inthis work, we present such a tool, OptiqueVQS, which is designed based on our experience with OBDA applications in Statoil andSiemens and on best HCI practices for interdisciplinary engineering environments. OptiqueVQS implements a number of uniquetechniques distinguishing it from analogous query formulation systems. In particular, it exploits ontology projection techniquesto enable graph-based navigation over an ontology during query construction. Secondly, while OptiqueVQS is primarily ontologydriven, it exploits sampled data to enhance selection of data values for some data attributes. Finally, OptiqueVQS is built onwell-grounded requirements, design rationale, and quality attributes. We evaluated OptiqueVQS with both domain experts andcasual users and qualitatively compared our system against prominent visual systems for ontology-driven query formulation andexploration of semantic data. OptiqueVQS is available online and can be downloaded together with an example OBDA scenario

Ontology Based Data Access in Statoil

Ontology Based Data Access (OBDA) is a prominent approach to query databases which uses an ontology to expose data in a conceptually clear manner by abstracting away from the technical schema-level details of the underlying data. The ontology is ‘connected’ to the data via mappings that allow to automatically translate queries posed over the ontology into data-level queries that can be executed by the underlying database management system. Despite a lot of attention from the research community, there are still few instances of real world industrial use of OBDA systems. In this work we present data access challenges in the data-intensive petroleum company Statoil and our experience in addressing these challenges with OBDA technology. In particular, we have developed a deployment module to create ontologies and mappings from relational databases in a semi-automatic fashion; a query processing module to perform and optimise the process of translating ontological queries into data queries and their execution over either a single DB of federated DBs; and a query formulation module to support query construction for engineers with a limited IT background. Our modules have been integrated in one OBDA system, deployed at Statoil, integrated with Statoil’s infrastructure, and evaluated with Statoil’s engineers and data

Scalable Semantic Access to Siemens Static and Streaming Distributed Data

Abstract. Numerous analytical tasks in industry rely on data integration solutions since they require data from multiple static and streaming data sources. In the context of the Optique project we have investigated how Semantic Technologies can enhance data integration and thus facilitate further data analysis. We introduced the notion Ontology-Based Stream-Static Data Integration and developed the system Optique to put our ideas in practice. In this demo we will show how Optique can help in diagnostics of power generating turbines in Siemens Energy. For this purpose we prepared anonymised streaming and static data from 950 Siemens power generating turbines with more than 100,000 sensors and deployed Optique on distributed environments with 128 nodes. The demo attendees will be able to see do diagnostics of turbines by registering and monitoring continuous queries that combine streaming and static data; to test scalability of our devoted stream management system that is able to process up to 1024 concurrent complex diagnostic queries with a 10 TB/day throughput; and to deploy Optique over Siemens demo data using our devoted interactive system to create abstraction semantic layers over data sources

Effects of adiponectin on breast cancer cell growth and signaling

Obesity is a risk factor for postmenopausal breast cancer. Adiponectin/Acrp30 is lower in obese individuals and may be negatively regulating breast cancer growth. Here we determined that five breast cancer cell lines, MDA-MB-231, MDA-MB-361, MCF-7, T47D, and SK-BR-3, expressed one or both of the Acrp30 receptors. In addition, we found that the addition of Acrp30 to MCF-7, T47D, and SK-BR-3 cell lines inhibited growth. Oestrogen receptor (ER) positive MCF-7 and T47D cells were inhibited at lower Acrp30 concentrations than ER-negative SK-BR-3 cells. Growth inhibition may be related to apoptosis since PARP cleavage was increased by Acrp30 in the ER-positive cell lines. To investigate the role of ER in the response of breast cancer cells to Acrp30, we established the MDA-ERα7 cell line by insertion of ER-α into ER-α-negative MDA-MB-231 cells. This line readily formed tumours in athymic mice and was responsive to oestradiol in vivo. In vitro, MDA-ERα7 cells were growth inhibited by globular Acrp30 while the parental cells were not. This inhibition appeared to be due to blockage of JNK2 signalling. These results provide information on how obesity may influence breast cancer cell proliferation and establish a new model to examine interactions between ER and Acrp30

Exploiting spatio-temporal correlations for data processing in sensor networks

Recent advances in microelectronics have made feasible the deployment of sensor networks for a variety of monitoring and surveillance tasks. In such tasks the state of the network is evaluated either at regular intervals at a base-station, which constitutes a centralized location where the data collected by the sensor nodes can be collected and processed, or continuously through the use of, potentially multiple, continuous queries. In order to increase the network lifetime, multiple techniques have been proposed in order to reduce the data transmitted in the network, since the data communication often constitutes the main source of energy drain in sensor networks. In this work we discuss several data reduction techniques that can be applied for energy-efficient query processing in sensor network applications. All of our proposed techniques seek to identify and take into account the characteristics of the collected data. Depending on the nature of the monitoring application at hand, the targeted data characteristics may range from simply monitoring the variance of a node's measurements to identifying spatio-temporal correlations amongst the values collected by the sensor nodes. © 2008 Springer-Verlag Berlin Heidelberg

Bandwidth-constrained queries in sensor networks

Sensor networks consist of battery-powered wireless devices that are required to operate unattended for long periods of time. Thus, reducing energy drain is of utmost importance when designing algorithms and applications for such networks. Aggregate queries are often used by monitoring applications to assess the status of the network and detect abnormal behavior. Since radio transmission often constitutes the biggest factor of energy drain in a node, in this paper we propose novel algorithms for the evaluation of bandwidth- constrained queries over sensor networks. The goal of our techniques is, given a target bandwidth utilization factor, to program the sensor nodes in a way that seeks to maximize the accuracy of the produced query results at the monitoring node, while always providing strong error guarantees to the monitoring application. This is a distinct difference of our framework from previous techniques that only provide probabilistic guarantees on the accuracy of the query result. Our algorithms are equally applicable when the nodes have ample power resources, but bandwidth consumption needs to be minimized, for instance in densely distributed networks, to ensure proper operation of the nodes. Our experiments with real sensor data show that bandwidth-constrained queries can substantially reduce the number of messages in the network while providing very tight error bounds on the query result. © 2006 Springer-Verlag

Collection trees for event-monitoring queries

In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries in a wireless sensor network. While prior techniques base their operation on the assumption that the sensor nodes that collect data relevant to a specified query need to include their measurements in the query result at every query epoch, in many event monitoring applications such an assumption is not valid. We introduce and formalize the notion of event monitoring queries and demonstrate that they can capture a large class of monitoring applications. We then show techniques which, using a small set of intuitive statistics, can compute collection trees that minimize important resources such as the number of messages exchanged among the nodes or the overall energy consumption. Our experiments demonstrate that our techniques can organize the data collection process while utilizing significantly lower resources than prior approaches. © 2010 Elsevier B.V. All rights reserved

Building efficient aggregation trees for sensor network event-monitoring queries

In this paper we present algorithms for building and maintaining efficient aggregation trees that provide the conduit to disseminate data required for processing monitoring queries in a wireless sensor network. While prior techniques base their operation on the assumption that the sensor nodes that collect data relevant to a specified query need to include their measurements in the query result at every query epoch, in many event monitoring applications such an assumption is not valid. We introduce and formalize the notion of event monitoring queries and demonstrate that they can capture a large class of monitoring applications. We then show techniques which, using a small set of intuitive statistics, can compute aggregation trees that minimize important resources such as the number of messages exchanged among the nodes or the overall energy consumption. Our experiments demonstrate that our techniques can organize the data aggregation process while utilizing significantly lower resources than prior approaches. © 2009 Springer Berlin Heidelberg